منابع مشابه
On Restrictions of Balanced 2-Interval Graphs
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify the introduction of a hierarchy of subclasses of 2-interval graphs that generalize line graphs: balanced 2-interval graphs, unit 2-interval graphs, and (x,x)...
متن کاملGossiping on Interval Graphs
We present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; diierent nodes have transceivers with diierent ranges. We assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, we assume that all nodes within ra...
متن کاملA linear time algorithm for the backup 2-center problem on a tree
In this paper, we are concerned with the problem of deploying two servers in a tree network, where each server may fail with a given probability. Once a server fails, the other server will take the whole responsibility of service for all vertices (clients). Here, we assume that the servers do not fail simultaneously. In the backup 2-center problem, we want to deploy two servers at the vertices ...
متن کاملOn strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملSharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs
The diameter diam(H) of a (directed) graph H is the maximum value computed over the lengths of all shortest (directed) paths in H . Given a bridgeless connected graph G, the oriented diameter OD(G) is given by OD(G) = min{diam(H) : H is an orientation of G}. In this paper, we show that OD(G) ≤ 2diam(G) +1 for every connected bridgeless interval graph G. Further, for every 2-connected proper int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.003